All capacities modular cost survivable network design problem using genetic algorithm with completely connection encoding
نویسندگان
چکیده
منابع مشابه
Improved Algorithm for Degree Bounded Survivable Network Design Problem
We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present an algorithm that finds a solution whose cost is at most twice the cost of the optimal solution while the d...
متن کاملAn efficient approximation algorithm for the survivable network design problem
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-t ime approximation algorithm was given by Williamson et al. (Combinatorica 15 (1995) 435454) . This paper gives an improved version that is more efficient. Consider a graph of n vertices and connectivity requirements that are at most...
متن کاملMulti-objective Genetic Algorithm for Solving the Multilayer Survivable Optical Network Design Problem
This paper considers the problem of designing a Multilayer Survivable Optical Network for the customers’ Demands Problem called MSONDP. The network is modelled by two graphs: an undirected graph G1 = (V1, E1) and a complete undirected and weighted graph G2 = (V2, E2, c). The goal objective of this problem is to design connections based on customers’ demands with the smallest a minimum network c...
متن کاملWireless sensor network design through genetic algorithm
In this paper, we study WSN design, as a multi-objective optimization problem using GA technique. We study the effects of GA parameters including population size, selection and crossover method and mutation probability on the design. Choosing suitable parameters is a trade-off between different network criteria and characteristics. Type of deployment, effect of network size, radio communication...
متن کاملOn the Survivable Network Design Problem with Mixed Connectivity Requirements
A graph is said to be (k, l)-connected if the resulted graph after removing of any k vertices and (l−1) edges or removing of any (k−1) vertices and l edges is still connected. Beineke and Harary (1967) (see [1]) claimed to prove that there should be k+ l edge-disjoint paths, of which k are vertex-disjoint, between any pair of vertices if the graph has (k, l)-connectivity. However, Mader (1979) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Human-centric Computing and Information Sciences
سال: 2014
ISSN: 2192-1962
DOI: 10.1186/s13673-014-0013-y